The Densest Packing of 13 Congruent Circles in a Circle
نویسنده
چکیده
The densest packings of n congruent circles in a circle are known for n ≤ 12 and n = 19. In this article we examine the case of 13 congruent circles. We show that the optimal configurations are identical to Kravitz’s conjecture. We use a technique developed from a method of Bateman and Erdős, which proved fruitful in investigating the cases n = 12 and 19. MSC 2000: 52C15
منابع مشابه
The Dense Packing of 13 Congruent Circles in a Circle
The densest packings of n congruent circles in a circle are known for n 12 and n = 19. In this paper we exhibit the densest packings of 13 congruent circles in a circle. We show that the optimal con gurations are identical to Kravitz's [11] conjecture. We use a technique developed from a method of Bateman and Erd}os [1] which proved fruitful in investigating the cases n = 12 and 19 by the autho...
متن کاملDense packings of congruent circles in a circle
The problem of finding packings of congruent circles in a circle, or, equivalently, of spreading points in a circle, is considered. Two packing algorithms are discussed, and the best packings found of up to 65 circles are presented.
متن کاملOptimal Substructures in Optimal and Approximate Circle Packings
This paper deals with the densest packing of equal circles in a square problem. Sharp bounds for the density of optimal circle packings have given. Several known optimal and approximate circle packings contain optimal substructures. Based on this observation it is sometimes easy to determine the minimal polynomials of the arrangements.
متن کاملJa n 20 07 Heron ’ s Formula , Descartes Circles , and Pythagorean Triangles
This article highlights interactions of diverse areas: the Heron formula for the area of a triangle, the Descartes circle equation, and right triangles with integer or rational sides. New and old results are synthesized. We first exploit elementary observations about circles to characterize an arbitrary triangle using three circles. A fourth circle brings a certain symmetry – the four radii are...
متن کاملDense Packing of Equal Circles on a Sphere by the Minimum-Zenith Method: Symmetrical Arrangement
Dense packing of equal circles on a sphere is investigated. A systematic algorithm, the Minimum-Zenith Method (MZM), is proposed in this report. Started from a proper initial configuration, a circle is sequentially packed one by one so that the zenith angle is as small as possible. It is necessary to fix the size of the circle and some initial configuration. Circle configurations we examined ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999